Evaluating bound-constrained minimization software
نویسندگان
چکیده
منابع مشابه
Evaluating bound-constrained minimization software
Bound-constrained minimization is a subject of active research. To assess the performance of existent solvers, numerical evaluations and comparisons are carried on. Arbitrary decisions that may have a crucial effect on the conclusions of numerical experiments are highlighted in the present work. As a result, an evaluation framework based on performance profiles is developed and applied to the c...
متن کاملPattern Search Algorithms for Bound Constrained Minimization
We present a convergence theory for pattern search methods for solving bound constrained nonlinear programs. The analysis relies on the abstract structure of pattern search methods and an understanding of how the pattern interacts with the bound constraints. This analysis makes it possible to develop pattern search methods for bound constrained problems while only slightly restricting the flexi...
متن کاملSymbolic-Interval Heuristic for Bound-Constrained Minimization
Global optimization subject to bound constraints helps answer many practical questions in chemistry, molecular biology, economics. Most of algorithms for solution of global optimization problems are a combination of interval methods and exhuastive search. The efficiency of such algorithms is characterized by their ability to detect and eliminate sub-optimal feasible regions. This ability is inc...
متن کاملBenchmarking of bound-constrained optimization software
In this report we describe a comparison of different algorithms for solving nonlinear optimization problems with simple bounds on the variables. Moreover, we would like to come out with an assessment of the optimization library DOT used in the optimization suite OPTALIA at Airbus for this kind of problems.
متن کاملAn adaptive algorithm for bound constrained quadratic minimization
A general algorithm for minimizing a quadratic function with bounds on the variables is presented. The new algorithm can use diierent un-constrained minimization techniques on diierent faces. At every face, the minimization technique can be chosen according to he structure of the Hessian and the dimension of the face. The strategy for leaving the face is based on a simple scheme that exploits t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2012
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-012-9466-y